Uncontrolled inexact information within bundle methods
نویسندگان
چکیده
منابع مشابه
Uncontrolled inexact information within bundle methods
We consider convex nonsmooth optimization problems where additional information with uncontrolled accuracy is readily available. It is often the case when the objective function is itself the output of an optimization solver, as for large-scale energy optimization problems tackled by decomposition. In this paper, we study how to incorporate the uncontrolled linearizations into (proximal and lev...
متن کاملInexact Dynamic Bundle Methods
We give a proximal bundle method for minimizing a convex function f over R+. It requires evaluating f and its subgradients with a possibly unknown accuracy ε ≥ 0, and maintains a set of free variables I to simplify its prox subproblems. The method asymptotically finds points that are ε-optimal. In Lagrangian relaxation of convex programs, it allows for ε-accurate solutions of Lagrangian subprob...
متن کاملNonsmooth Optimization Using Uncontrolled Inexact Information
We consider convex nonsmooth optimization problems whose objective function is known through a (fine) oracle together with some additional (cheap but poor) information – formalized as a second coarse oracle wih uncontrolled inexactness. It is the case when the objective function is itself the output of an optimization solver, using a branch-and-bound procedure, or decomposing the problem into p...
متن کاملBundle Methods for Convex Minimization with Partially Inexact Oracles
Recently the proximal bundle method for minimizing a convex function has been extended to an inexact oracle that delivers function and subgradient values of unknown accuracy. We adapt this method to a partially inexact oracle that becomes exact only when an objective target level for a descent step is met. In Lagrangian relaxation, such oracles may save work by evaluating the dual function appr...
متن کاملInexact Bundle Methods for Two-Stage Stochastic Programming
Stochastic programming problems arise in many practical situations. In general, the deterministic equivalents of these problems can be very large and may not be solvable directly by general-purpose optimization approaches. For the particular case of two-stage stochastic programs, we consider decomposition approaches akin to a regularized L-shaped method that can handle inexactness in the subpro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Computational Optimization
سال: 2016
ISSN: 2192-4406,2192-4414
DOI: 10.1007/s13675-015-0060-9